One Diophantine inequality with integer and prime variables
نویسندگان
چکیده
منابع مشابه
One Diophantine inequality with integer and prime variables
*Correspondence: [email protected] 2Department of Mathematics and Information Science, Henan University of Economics and Law, Zhengzhou, 450046, P.R. China Full list of author information is available at the end of the article Abstract In this paper, we show that if λ1, λ2, λ3, λ4 are positive real numbers, at least one of the ratios λi/λj (1≤ i < j≤ 4) is irrational, then the inequality |λ1x2 1 +...
متن کاملRewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem
This paper is concerned with the integer quadratic multidimensional knapsack problem (QMKP) where the objective function is separable. Our objective is to determine which expansion technique of the integer variables is the most appropriate to solve (QMKP) to optimality using the upper bound method proposed by Quadri et al. (2007). To the best of our knowledge the upper bound method previously m...
متن کاملSimple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
The authors present an O(inn log m) algorithm for solving feasibility in linear programs with up to two variables per inequality which is derived directly from the Fourier-Motzkin elimination method. (The number of variables and inequalities are denoted by n and m, respectively.) The running time of the algorithm dominates that of the best known algorithm for the problem, and is far simpler. In...
متن کاملTight bounds and 2-approximation algorithms for integer programs with two variables per inequality
The problem of integer programming in bounded variables, over constraints with no more than two variables in each constraint is NP-complete, even when all variables are binary. This paper deals with integer linear minimization problems in n variables subject to m linear constraints with at most two variables per inequality, and with all variables bounded between 0 and U. For such systems, a 2?a...
متن کاملTight Bounds and Approximation Algorithms for Integer Programs with Two Variables per Inequality
The problem of integer programming in bounded variables over constraints with no more than two variables in each constraint is NP complete even when all variables are binary This paper deals with integer linear minimization problems in n variables subject to m linear constraints with at most two variables per inequality and with all variables bounded between and U For such systems a approximati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2015
ISSN: 1029-242X
DOI: 10.1186/s13660-015-0817-y